-
1 acyclic cover
Большой англо-русский и русско-английский словарь > acyclic cover
-
2 acyclic cover
Математика: ациклическое покрытие -
3 acyclic cover
-
4 acyclic
1) ацикличный
2) нециклический
3) научн. непериодический
4) ациклический ∙ integrally acyclic complex ≈ целочисленно ацикличный комплекс maximal acyclic digraph ≈ максимальный ациклический орграф method of acyclic models ≈ метод ацикличных моделей rationally acyclic complex ≈ рационально ацикличный комплекс - acyclic algebra - acyclic carrier - acyclic complex - acyclic continuum - acyclic cover - acyclic fibration - acyclic function - acyclic graph - acyclic image - acyclic manifold - acyclic model - acyclic morphism - acyclic net - acyclic object - acyclic orientation - acyclic parallelotope - acyclic polyhedron - acyclic property - acyclic relation - acyclic resolvent - acyclic set - acyclic sheaf - acyclic simplex - acyclic space - acyclic star - acyclic subcomplex - acyclic support - acyclic tree(техническое) нецикличный;
непериодического действия( химическое) ациклический (математика) непериодический (ботаника) спиральныйacyclic апериодический ~ непериодический -
5 cover
1) крышка || закрывать крышкой2) покрытие || покрывать, наносить покрытие3) оболочка; чехол; футляр4) обёртка; обложка5) накрытие; покров6) покрывало; одеяло7) убежище, укрытие9) горн. покрывающие породы, кровля•under a closed cover — почт. в закрытом конверте
-
6 ациклическое покрытие
Большой англо-русский и русско-английский словарь > ациклическое покрытие
См. также в других словарях:
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Injective sheaf — In mathematics, injective sheaves of abelian groups are used to construct the resolutions needed to define sheaf cohomology (and other derived functors, such as sheaf Ext .). There is a further group of related concepts applied to sheaves: flabby … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Fibration — In mathematics, especially algebraic topology, a fibration is a continuous mapping:p:E o B,satisfying the homotopy lifting property with respect to any space. Fiber bundles (over paracompact bases) constitute important examples. In homotopy… … Wikipedia
Feedback arc set — In graph theory, a directed graph may contain directed cycles, a one way loop of edges. In some applications, such cycles are undesirable, and we wish to eliminate them and obtain a directed acyclic graph (DAG). One way to do this is simply to… … Wikipedia